Convex Calibrated Surrogates for Hierarchical Classification Convex Calibrated Surrogates for Hierarchical Classification

ثبت نشده
چکیده

A. Additional Notation and Setup Let μ be the marginal distribution induced by D over X , and let p(x) be the distribution over [n] conditioned on X = x. For every function ` : [n]⇥ [k]!R+ and t 2 [k] let `t = [`(1, t), . . . , `(n, t)]> 2 R+. For every surrogate : [n]⇥ R!R+ let : R!R+ be a vector function such that y(u) = (y,u) for y 2 [n],u 2 Rd. For any integer d0 2 Z+ and pair of vectors u,v 2 Rd , their inner product is denoted as hu,vi = Pd0 i=1 uivi. For a vector u 2 Rn and a positive integer a  n, the vector u 1:a 2 Ra gives the first a components of u. Define the conditional regrets R` H p , R` ?,n p and R p as the regrets incurred for a singleton instance space X , with conditional probability p 2 n. In particular, we have that R H p [b y] = hp, ` H b y i inf y02[n] hp, `y0i, 8b y 2 [n] R ?,n p [b y] = hp, ` ?,n b y i inf y02[n][{?} hp, ` y0 i, 8b y 2 [n] [ {?} R p [u] = hp, (u)i inf u02Rd hp, (u0)i, 8u 2 R .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Calibrated Surrogates for Hierarchical Classification

Hierarchical classification problems are multiclass supervised learning problems with a predefined hierarchy over the set of class labels. In this work, we study the consistency of hierarchical classification algorithms with respect to a natural loss, namely the tree distance metric on the hierarchy tree of class labels, via the usage of calibrated surrogates. We first show that the Bayes optim...

متن کامل

On the Efficient Minimization of Classification Calibrated Surrogates

Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risks, and left as an important problem the algorithmic questions about the minimization of these surrogates. In this paper, we propose an algorithm which provably minimizes any classification calibrated surrogate strictly...

متن کامل

Convex Calibration Dimension for Multiclass Loss Matrices

We study consistency properties of surrogate loss functions for general multiclass learning problems, defined by a general multiclass loss matrix. We extend the notion of classification calibration, which has been studied for binary and multiclass 0-1 classification problems (and for certain other specific learning problems), to the general multiclass setting, and derive necessary and sufficien...

متن کامل

Convex Calibrated Surrogates for Low-Rank Loss Matrices with Applications to Subset Ranking Losses

The design of convex, calibrated surrogate losses, whose minimization entails consistency with respect to a desired target loss, is an important concept to have emerged in the theory of machine learning in recent years. We give an explicit construction of a convex least-squares type surrogate loss that can be designed to be calibrated for any multiclass learning problem for which the target los...

متن کامل

Classification Calibration Dimension for General Multiclass Losses

We study consistency properties of surrogate loss functions for general multiclass classification problems, defined by a general loss matrix. We extend the notion of classification calibration, which has been studied for binary and multiclass 0-1 classification problems (and for certain other specific learning problems), to the general multiclass setting, and derive necessary and sufficient con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015